B_2分子X~3Σ_g~-和A~3Σ_u~-态的势能函数

使用SAC/SAC-CI方法,利用D95(d),6-311g**以及cc-PVTZ等基组,对B2分子的基态(X3Σg-)和第一激发态(A3Σu-)的平衡结构和谐振频率进行了优化计算.通过对3个基组的计算结果的比较,得出了D95(d)基组为3个基组中的最优基组的结论;使用D95(d)基组,利用SAC的GSUM(Group Sum of Operators)方法对基态(X3Σg-),SAC-CI的GSUM方法对激发态(A3Σu-)进行单点能扫描计算,用正规方程组拟合Murrell-Sorbie函数,得到了相应电子态的完整势能函数;从得到的势能函数计算了与基态(X3Σg-)和第一激发态(A3Σu-)相对应的光谱常数(Be,αe,ωe和ωeχe),结果与实验数据吻合.     

左手介质椭圆光波导基模传播特性

在椭圆柱坐标系中，采用分离变量方法，得出了左手介质椭圆光波导本征方程的近似解，通过数值计算，分析了椭圆波导偏心率、左手介质的电容率、磁导率对椭圆光波导基模传播特性的影响，并将左介质光波导与右手介质光波导基模特性进行对比，得出左手介质光波导的基模特性与右手介质光波导基模特性差别不大的结论.     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

Q过程的不变分布(Ⅱ)

设E为一个可数集,Q=（qi,j;i,j∈E）为E×E上的矩阵,满足m为E上的概率分布满足何时存在Q过程,使得m是它的不变分布? 这个问题由Williams（1979）作为一个开问题提出.文[15]对全稳定情形,解决了这个问题;本文对单瞬时情形,完整地解决了该问题.     

Nonsensitiveness Regions for Threshold Ellipsoids

The problem is to determine nonsensitiveness regions for threshold ellipsoids within a regular mixed linear model.     

平面分拆的矢量控制方法：列严格梯形平面分拆

作为移位平面分拆的自然拓广,本文引入了梯形平面分拆的概念.应用矢量控制技巧,建立了给定形状和行(列)分部约束的列严格梯形平面分拆集合之枚举函数的初等对称函数行列式表达式.其中之一的重要特例构成了关于循环对称平面分拆的Macdonald猜想的证明基础.     

A stochastic algorithm using one sample point per iteration and diminishing stepsizes

A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex _i , one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx ₁,x ₂,...generated by the algorithm is bounded, then all of its accumulation points are stationary.     

配送量不定的供应链协调

本文研究供应链管理中配送量不确定时，制造商和分销商之间的协调问题。通过建立惩罚和奖励机制模型来协调供应链各部分的运作，使得分散系统就如一个整体。同时分析供应链的利润分配问题，分别得出各个机制下分销商的最优决策。